<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT>    /*<a name="line.1"></a>
<FONT color="green">002</FONT>     * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a>
<FONT color="green">003</FONT>     * contributor license agreements.  See the NOTICE file distributed with<a name="line.3"></a>
<FONT color="green">004</FONT>     * this work for additional information regarding copyright ownership.<a name="line.4"></a>
<FONT color="green">005</FONT>     * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a>
<FONT color="green">006</FONT>     * (the "License"); you may not use this file except in compliance with<a name="line.6"></a>
<FONT color="green">007</FONT>     * the License.  You may obtain a copy of the License at<a name="line.7"></a>
<FONT color="green">008</FONT>     *<a name="line.8"></a>
<FONT color="green">009</FONT>     *      http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a>
<FONT color="green">010</FONT>     *<a name="line.10"></a>
<FONT color="green">011</FONT>     * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a>
<FONT color="green">012</FONT>     * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a>
<FONT color="green">013</FONT>     * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a>
<FONT color="green">014</FONT>     * See the License for the specific language governing permissions and<a name="line.14"></a>
<FONT color="green">015</FONT>     * limitations under the License.<a name="line.15"></a>
<FONT color="green">016</FONT>     */<a name="line.16"></a>
<FONT color="green">017</FONT>    package org.apache.commons.math3.geometry.partitioning;<a name="line.17"></a>
<FONT color="green">018</FONT>    <a name="line.18"></a>
<FONT color="green">019</FONT>    import org.apache.commons.math3.geometry.Space;<a name="line.19"></a>
<FONT color="green">020</FONT>    <a name="line.20"></a>
<FONT color="green">021</FONT>    /** This class is a factory for {@link Region}.<a name="line.21"></a>
<FONT color="green">022</FONT>    <a name="line.22"></a>
<FONT color="green">023</FONT>     * @param &lt;S&gt; Type of the space.<a name="line.23"></a>
<FONT color="green">024</FONT>    <a name="line.24"></a>
<FONT color="green">025</FONT>     * @version $Id: RegionFactory.java 1416643 2012-12-03 19:37:14Z tn $<a name="line.25"></a>
<FONT color="green">026</FONT>     * @since 3.0<a name="line.26"></a>
<FONT color="green">027</FONT>     */<a name="line.27"></a>
<FONT color="green">028</FONT>    public class RegionFactory&lt;S extends Space&gt; {<a name="line.28"></a>
<FONT color="green">029</FONT>    <a name="line.29"></a>
<FONT color="green">030</FONT>        /** Visitor removing internal nodes attributes. */<a name="line.30"></a>
<FONT color="green">031</FONT>        private final NodesCleaner nodeCleaner;<a name="line.31"></a>
<FONT color="green">032</FONT>    <a name="line.32"></a>
<FONT color="green">033</FONT>        /** Simple constructor.<a name="line.33"></a>
<FONT color="green">034</FONT>         */<a name="line.34"></a>
<FONT color="green">035</FONT>        public RegionFactory() {<a name="line.35"></a>
<FONT color="green">036</FONT>            nodeCleaner = new NodesCleaner();<a name="line.36"></a>
<FONT color="green">037</FONT>        }<a name="line.37"></a>
<FONT color="green">038</FONT>    <a name="line.38"></a>
<FONT color="green">039</FONT>        /** Build a convex region from a collection of bounding hyperplanes.<a name="line.39"></a>
<FONT color="green">040</FONT>         * @param hyperplanes collection of bounding hyperplanes<a name="line.40"></a>
<FONT color="green">041</FONT>         * @return a new convex region, or null if the collection is empty<a name="line.41"></a>
<FONT color="green">042</FONT>         */<a name="line.42"></a>
<FONT color="green">043</FONT>        public Region&lt;S&gt; buildConvex(final Hyperplane&lt;S&gt; ... hyperplanes) {<a name="line.43"></a>
<FONT color="green">044</FONT>            if ((hyperplanes == null) || (hyperplanes.length == 0)) {<a name="line.44"></a>
<FONT color="green">045</FONT>                return null;<a name="line.45"></a>
<FONT color="green">046</FONT>            }<a name="line.46"></a>
<FONT color="green">047</FONT>    <a name="line.47"></a>
<FONT color="green">048</FONT>            // use the first hyperplane to build the right class<a name="line.48"></a>
<FONT color="green">049</FONT>            final Region&lt;S&gt; region = hyperplanes[0].wholeSpace();<a name="line.49"></a>
<FONT color="green">050</FONT>    <a name="line.50"></a>
<FONT color="green">051</FONT>            // chop off parts of the space<a name="line.51"></a>
<FONT color="green">052</FONT>            BSPTree&lt;S&gt; node = region.getTree(false);<a name="line.52"></a>
<FONT color="green">053</FONT>            node.setAttribute(Boolean.TRUE);<a name="line.53"></a>
<FONT color="green">054</FONT>            for (final Hyperplane&lt;S&gt; hyperplane : hyperplanes) {<a name="line.54"></a>
<FONT color="green">055</FONT>                if (node.insertCut(hyperplane)) {<a name="line.55"></a>
<FONT color="green">056</FONT>                    node.setAttribute(null);<a name="line.56"></a>
<FONT color="green">057</FONT>                    node.getPlus().setAttribute(Boolean.FALSE);<a name="line.57"></a>
<FONT color="green">058</FONT>                    node = node.getMinus();<a name="line.58"></a>
<FONT color="green">059</FONT>                    node.setAttribute(Boolean.TRUE);<a name="line.59"></a>
<FONT color="green">060</FONT>                }<a name="line.60"></a>
<FONT color="green">061</FONT>            }<a name="line.61"></a>
<FONT color="green">062</FONT>    <a name="line.62"></a>
<FONT color="green">063</FONT>            return region;<a name="line.63"></a>
<FONT color="green">064</FONT>    <a name="line.64"></a>
<FONT color="green">065</FONT>        }<a name="line.65"></a>
<FONT color="green">066</FONT>    <a name="line.66"></a>
<FONT color="green">067</FONT>        /** Compute the union of two regions.<a name="line.67"></a>
<FONT color="green">068</FONT>         * @param region1 first region (will be unusable after the operation as<a name="line.68"></a>
<FONT color="green">069</FONT>         * parts of it will be reused in the new region)<a name="line.69"></a>
<FONT color="green">070</FONT>         * @param region2 second region (will be unusable after the operation as<a name="line.70"></a>
<FONT color="green">071</FONT>         * parts of it will be reused in the new region)<a name="line.71"></a>
<FONT color="green">072</FONT>         * @return a new region, result of {@code region1 union region2}<a name="line.72"></a>
<FONT color="green">073</FONT>         */<a name="line.73"></a>
<FONT color="green">074</FONT>        public Region&lt;S&gt; union(final Region&lt;S&gt; region1, final Region&lt;S&gt; region2) {<a name="line.74"></a>
<FONT color="green">075</FONT>            final BSPTree&lt;S&gt; tree =<a name="line.75"></a>
<FONT color="green">076</FONT>                region1.getTree(false).merge(region2.getTree(false), new UnionMerger());<a name="line.76"></a>
<FONT color="green">077</FONT>            tree.visit(nodeCleaner);<a name="line.77"></a>
<FONT color="green">078</FONT>            return region1.buildNew(tree);<a name="line.78"></a>
<FONT color="green">079</FONT>        }<a name="line.79"></a>
<FONT color="green">080</FONT>    <a name="line.80"></a>
<FONT color="green">081</FONT>        /** Compute the intersection of two regions.<a name="line.81"></a>
<FONT color="green">082</FONT>         * @param region1 first region (will be unusable after the operation as<a name="line.82"></a>
<FONT color="green">083</FONT>         * parts of it will be reused in the new region)<a name="line.83"></a>
<FONT color="green">084</FONT>         * @param region2 second region (will be unusable after the operation as<a name="line.84"></a>
<FONT color="green">085</FONT>         * parts of it will be reused in the new region)<a name="line.85"></a>
<FONT color="green">086</FONT>         * @return a new region, result of {@code region1 intersection region2}<a name="line.86"></a>
<FONT color="green">087</FONT>         */<a name="line.87"></a>
<FONT color="green">088</FONT>        public Region&lt;S&gt; intersection(final Region&lt;S&gt; region1, final Region&lt;S&gt; region2) {<a name="line.88"></a>
<FONT color="green">089</FONT>            final BSPTree&lt;S&gt; tree =<a name="line.89"></a>
<FONT color="green">090</FONT>                region1.getTree(false).merge(region2.getTree(false), new IntersectionMerger());<a name="line.90"></a>
<FONT color="green">091</FONT>            tree.visit(nodeCleaner);<a name="line.91"></a>
<FONT color="green">092</FONT>            return region1.buildNew(tree);<a name="line.92"></a>
<FONT color="green">093</FONT>        }<a name="line.93"></a>
<FONT color="green">094</FONT>    <a name="line.94"></a>
<FONT color="green">095</FONT>        /** Compute the symmetric difference (exclusive or) of two regions.<a name="line.95"></a>
<FONT color="green">096</FONT>         * @param region1 first region (will be unusable after the operation as<a name="line.96"></a>
<FONT color="green">097</FONT>         * parts of it will be reused in the new region)<a name="line.97"></a>
<FONT color="green">098</FONT>         * @param region2 second region (will be unusable after the operation as<a name="line.98"></a>
<FONT color="green">099</FONT>         * parts of it will be reused in the new region)<a name="line.99"></a>
<FONT color="green">100</FONT>         * @return a new region, result of {@code region1 xor region2}<a name="line.100"></a>
<FONT color="green">101</FONT>         */<a name="line.101"></a>
<FONT color="green">102</FONT>        public Region&lt;S&gt; xor(final Region&lt;S&gt; region1, final Region&lt;S&gt; region2) {<a name="line.102"></a>
<FONT color="green">103</FONT>            final BSPTree&lt;S&gt; tree =<a name="line.103"></a>
<FONT color="green">104</FONT>                region1.getTree(false).merge(region2.getTree(false), new XorMerger());<a name="line.104"></a>
<FONT color="green">105</FONT>            tree.visit(nodeCleaner);<a name="line.105"></a>
<FONT color="green">106</FONT>            return region1.buildNew(tree);<a name="line.106"></a>
<FONT color="green">107</FONT>        }<a name="line.107"></a>
<FONT color="green">108</FONT>    <a name="line.108"></a>
<FONT color="green">109</FONT>        /** Compute the difference of two regions.<a name="line.109"></a>
<FONT color="green">110</FONT>         * @param region1 first region (will be unusable after the operation as<a name="line.110"></a>
<FONT color="green">111</FONT>         * parts of it will be reused in the new region)<a name="line.111"></a>
<FONT color="green">112</FONT>         * @param region2 second region (will be unusable after the operation as<a name="line.112"></a>
<FONT color="green">113</FONT>         * parts of it will be reused in the new region)<a name="line.113"></a>
<FONT color="green">114</FONT>         * @return a new region, result of {@code region1 minus region2}<a name="line.114"></a>
<FONT color="green">115</FONT>         */<a name="line.115"></a>
<FONT color="green">116</FONT>        public Region&lt;S&gt; difference(final Region&lt;S&gt; region1, final Region&lt;S&gt; region2) {<a name="line.116"></a>
<FONT color="green">117</FONT>            final BSPTree&lt;S&gt; tree =<a name="line.117"></a>
<FONT color="green">118</FONT>                region1.getTree(false).merge(region2.getTree(false), new DifferenceMerger());<a name="line.118"></a>
<FONT color="green">119</FONT>            tree.visit(nodeCleaner);<a name="line.119"></a>
<FONT color="green">120</FONT>            return region1.buildNew(tree);<a name="line.120"></a>
<FONT color="green">121</FONT>        }<a name="line.121"></a>
<FONT color="green">122</FONT>    <a name="line.122"></a>
<FONT color="green">123</FONT>        /** Get the complement of the region (exchanged interior/exterior).<a name="line.123"></a>
<FONT color="green">124</FONT>         * @param region region to complement, it will not modified, a new<a name="line.124"></a>
<FONT color="green">125</FONT>         * region independent region will be built<a name="line.125"></a>
<FONT color="green">126</FONT>         * @return a new region, complement of the specified one<a name="line.126"></a>
<FONT color="green">127</FONT>         */<a name="line.127"></a>
<FONT color="green">128</FONT>        public Region&lt;S&gt; getComplement(final Region&lt;S&gt; region) {<a name="line.128"></a>
<FONT color="green">129</FONT>            return region.buildNew(recurseComplement(region.getTree(false)));<a name="line.129"></a>
<FONT color="green">130</FONT>        }<a name="line.130"></a>
<FONT color="green">131</FONT>    <a name="line.131"></a>
<FONT color="green">132</FONT>        /** Recursively build the complement of a BSP tree.<a name="line.132"></a>
<FONT color="green">133</FONT>         * @param node current node of the original tree<a name="line.133"></a>
<FONT color="green">134</FONT>         * @return new tree, complement of the node<a name="line.134"></a>
<FONT color="green">135</FONT>         */<a name="line.135"></a>
<FONT color="green">136</FONT>        private BSPTree&lt;S&gt; recurseComplement(final BSPTree&lt;S&gt; node) {<a name="line.136"></a>
<FONT color="green">137</FONT>            if (node.getCut() == null) {<a name="line.137"></a>
<FONT color="green">138</FONT>                return new BSPTree&lt;S&gt;(((Boolean) node.getAttribute()) ? Boolean.FALSE : Boolean.TRUE);<a name="line.138"></a>
<FONT color="green">139</FONT>            }<a name="line.139"></a>
<FONT color="green">140</FONT>    <a name="line.140"></a>
<FONT color="green">141</FONT>            @SuppressWarnings("unchecked")<a name="line.141"></a>
<FONT color="green">142</FONT>            BoundaryAttribute&lt;S&gt; attribute = (BoundaryAttribute&lt;S&gt;) node.getAttribute();<a name="line.142"></a>
<FONT color="green">143</FONT>            if (attribute != null) {<a name="line.143"></a>
<FONT color="green">144</FONT>                final SubHyperplane&lt;S&gt; plusOutside =<a name="line.144"></a>
<FONT color="green">145</FONT>                    (attribute.getPlusInside() == null) ? null : attribute.getPlusInside().copySelf();<a name="line.145"></a>
<FONT color="green">146</FONT>                final SubHyperplane&lt;S&gt; plusInside  =<a name="line.146"></a>
<FONT color="green">147</FONT>                    (attribute.getPlusOutside() == null) ? null : attribute.getPlusOutside().copySelf();<a name="line.147"></a>
<FONT color="green">148</FONT>                attribute = new BoundaryAttribute&lt;S&gt;(plusOutside, plusInside);<a name="line.148"></a>
<FONT color="green">149</FONT>            }<a name="line.149"></a>
<FONT color="green">150</FONT>    <a name="line.150"></a>
<FONT color="green">151</FONT>            return new BSPTree&lt;S&gt;(node.getCut().copySelf(),<a name="line.151"></a>
<FONT color="green">152</FONT>                                  recurseComplement(node.getPlus()),<a name="line.152"></a>
<FONT color="green">153</FONT>                                  recurseComplement(node.getMinus()),<a name="line.153"></a>
<FONT color="green">154</FONT>                                  attribute);<a name="line.154"></a>
<FONT color="green">155</FONT>    <a name="line.155"></a>
<FONT color="green">156</FONT>        }<a name="line.156"></a>
<FONT color="green">157</FONT>    <a name="line.157"></a>
<FONT color="green">158</FONT>        /** BSP tree leaf merger computing union of two regions. */<a name="line.158"></a>
<FONT color="green">159</FONT>        private class UnionMerger implements BSPTree.LeafMerger&lt;S&gt; {<a name="line.159"></a>
<FONT color="green">160</FONT>            /** {@inheritDoc} */<a name="line.160"></a>
<FONT color="green">161</FONT>            public BSPTree&lt;S&gt; merge(final BSPTree&lt;S&gt; leaf, final BSPTree&lt;S&gt; tree,<a name="line.161"></a>
<FONT color="green">162</FONT>                                    final BSPTree&lt;S&gt; parentTree,<a name="line.162"></a>
<FONT color="green">163</FONT>                                    final boolean isPlusChild, final boolean leafFromInstance) {<a name="line.163"></a>
<FONT color="green">164</FONT>                if ((Boolean) leaf.getAttribute()) {<a name="line.164"></a>
<FONT color="green">165</FONT>                    // the leaf node represents an inside cell<a name="line.165"></a>
<FONT color="green">166</FONT>                    leaf.insertInTree(parentTree, isPlusChild);<a name="line.166"></a>
<FONT color="green">167</FONT>                    return leaf;<a name="line.167"></a>
<FONT color="green">168</FONT>                }<a name="line.168"></a>
<FONT color="green">169</FONT>                // the leaf node represents an outside cell<a name="line.169"></a>
<FONT color="green">170</FONT>                tree.insertInTree(parentTree, isPlusChild);<a name="line.170"></a>
<FONT color="green">171</FONT>                return tree;<a name="line.171"></a>
<FONT color="green">172</FONT>            }<a name="line.172"></a>
<FONT color="green">173</FONT>        }<a name="line.173"></a>
<FONT color="green">174</FONT>    <a name="line.174"></a>
<FONT color="green">175</FONT>        /** BSP tree leaf merger computing union of two regions. */<a name="line.175"></a>
<FONT color="green">176</FONT>        private class IntersectionMerger implements BSPTree.LeafMerger&lt;S&gt; {<a name="line.176"></a>
<FONT color="green">177</FONT>            /** {@inheritDoc} */<a name="line.177"></a>
<FONT color="green">178</FONT>            public BSPTree&lt;S&gt; merge(final BSPTree&lt;S&gt; leaf, final BSPTree&lt;S&gt; tree,<a name="line.178"></a>
<FONT color="green">179</FONT>                                    final BSPTree&lt;S&gt; parentTree,<a name="line.179"></a>
<FONT color="green">180</FONT>                                    final boolean isPlusChild, final boolean leafFromInstance) {<a name="line.180"></a>
<FONT color="green">181</FONT>                if ((Boolean) leaf.getAttribute()) {<a name="line.181"></a>
<FONT color="green">182</FONT>                    // the leaf node represents an inside cell<a name="line.182"></a>
<FONT color="green">183</FONT>                    tree.insertInTree(parentTree, isPlusChild);<a name="line.183"></a>
<FONT color="green">184</FONT>                    return tree;<a name="line.184"></a>
<FONT color="green">185</FONT>                }<a name="line.185"></a>
<FONT color="green">186</FONT>                // the leaf node represents an outside cell<a name="line.186"></a>
<FONT color="green">187</FONT>                leaf.insertInTree(parentTree, isPlusChild);<a name="line.187"></a>
<FONT color="green">188</FONT>                return leaf;<a name="line.188"></a>
<FONT color="green">189</FONT>            }<a name="line.189"></a>
<FONT color="green">190</FONT>        }<a name="line.190"></a>
<FONT color="green">191</FONT>    <a name="line.191"></a>
<FONT color="green">192</FONT>        /** BSP tree leaf merger computing union of two regions. */<a name="line.192"></a>
<FONT color="green">193</FONT>        private class XorMerger implements BSPTree.LeafMerger&lt;S&gt; {<a name="line.193"></a>
<FONT color="green">194</FONT>            /** {@inheritDoc} */<a name="line.194"></a>
<FONT color="green">195</FONT>            public BSPTree&lt;S&gt; merge(final BSPTree&lt;S&gt; leaf, final BSPTree&lt;S&gt; tree,<a name="line.195"></a>
<FONT color="green">196</FONT>                                    final BSPTree&lt;S&gt; parentTree, final boolean isPlusChild,<a name="line.196"></a>
<FONT color="green">197</FONT>                                    final boolean leafFromInstance) {<a name="line.197"></a>
<FONT color="green">198</FONT>                BSPTree&lt;S&gt; t = tree;<a name="line.198"></a>
<FONT color="green">199</FONT>                if ((Boolean) leaf.getAttribute()) {<a name="line.199"></a>
<FONT color="green">200</FONT>                    // the leaf node represents an inside cell<a name="line.200"></a>
<FONT color="green">201</FONT>                    t = recurseComplement(t);<a name="line.201"></a>
<FONT color="green">202</FONT>                }<a name="line.202"></a>
<FONT color="green">203</FONT>                t.insertInTree(parentTree, isPlusChild);<a name="line.203"></a>
<FONT color="green">204</FONT>                return t;<a name="line.204"></a>
<FONT color="green">205</FONT>            }<a name="line.205"></a>
<FONT color="green">206</FONT>        }<a name="line.206"></a>
<FONT color="green">207</FONT>    <a name="line.207"></a>
<FONT color="green">208</FONT>        /** BSP tree leaf merger computing union of two regions. */<a name="line.208"></a>
<FONT color="green">209</FONT>        private class DifferenceMerger implements BSPTree.LeafMerger&lt;S&gt; {<a name="line.209"></a>
<FONT color="green">210</FONT>            /** {@inheritDoc} */<a name="line.210"></a>
<FONT color="green">211</FONT>            public BSPTree&lt;S&gt; merge(final BSPTree&lt;S&gt; leaf, final BSPTree&lt;S&gt; tree,<a name="line.211"></a>
<FONT color="green">212</FONT>                                    final BSPTree&lt;S&gt; parentTree, final boolean isPlusChild,<a name="line.212"></a>
<FONT color="green">213</FONT>                                    final boolean leafFromInstance) {<a name="line.213"></a>
<FONT color="green">214</FONT>                if ((Boolean) leaf.getAttribute()) {<a name="line.214"></a>
<FONT color="green">215</FONT>                    // the leaf node represents an inside cell<a name="line.215"></a>
<FONT color="green">216</FONT>                    final BSPTree&lt;S&gt; argTree =<a name="line.216"></a>
<FONT color="green">217</FONT>                        recurseComplement(leafFromInstance ? tree : leaf);<a name="line.217"></a>
<FONT color="green">218</FONT>                    argTree.insertInTree(parentTree, isPlusChild);<a name="line.218"></a>
<FONT color="green">219</FONT>                    return argTree;<a name="line.219"></a>
<FONT color="green">220</FONT>                }<a name="line.220"></a>
<FONT color="green">221</FONT>                // the leaf node represents an outside cell<a name="line.221"></a>
<FONT color="green">222</FONT>                final BSPTree&lt;S&gt; instanceTree =<a name="line.222"></a>
<FONT color="green">223</FONT>                    leafFromInstance ? leaf : tree;<a name="line.223"></a>
<FONT color="green">224</FONT>                instanceTree.insertInTree(parentTree, isPlusChild);<a name="line.224"></a>
<FONT color="green">225</FONT>                return instanceTree;<a name="line.225"></a>
<FONT color="green">226</FONT>            }<a name="line.226"></a>
<FONT color="green">227</FONT>        }<a name="line.227"></a>
<FONT color="green">228</FONT>    <a name="line.228"></a>
<FONT color="green">229</FONT>        /** Visitor removing internal nodes attributes. */<a name="line.229"></a>
<FONT color="green">230</FONT>        private class NodesCleaner implements  BSPTreeVisitor&lt;S&gt; {<a name="line.230"></a>
<FONT color="green">231</FONT>    <a name="line.231"></a>
<FONT color="green">232</FONT>            /** {@inheritDoc} */<a name="line.232"></a>
<FONT color="green">233</FONT>            public Order visitOrder(final BSPTree&lt;S&gt; node) {<a name="line.233"></a>
<FONT color="green">234</FONT>                return Order.PLUS_SUB_MINUS;<a name="line.234"></a>
<FONT color="green">235</FONT>            }<a name="line.235"></a>
<FONT color="green">236</FONT>    <a name="line.236"></a>
<FONT color="green">237</FONT>            /** {@inheritDoc} */<a name="line.237"></a>
<FONT color="green">238</FONT>            public void visitInternalNode(final BSPTree&lt;S&gt; node) {<a name="line.238"></a>
<FONT color="green">239</FONT>                node.setAttribute(null);<a name="line.239"></a>
<FONT color="green">240</FONT>            }<a name="line.240"></a>
<FONT color="green">241</FONT>    <a name="line.241"></a>
<FONT color="green">242</FONT>            /** {@inheritDoc} */<a name="line.242"></a>
<FONT color="green">243</FONT>            public void visitLeafNode(final BSPTree&lt;S&gt; node) {<a name="line.243"></a>
<FONT color="green">244</FONT>            }<a name="line.244"></a>
<FONT color="green">245</FONT>    <a name="line.245"></a>
<FONT color="green">246</FONT>        }<a name="line.246"></a>
<FONT color="green">247</FONT>    <a name="line.247"></a>
<FONT color="green">248</FONT>    }<a name="line.248"></a>




























































</PRE>
</BODY>
</HTML>
